On the Power of Laconic Advice in Communication Complexity
نویسندگان
چکیده
We continue the study of a recently introduced model of communication complexity with advice, focusing on the power of advice in the context of equality of bitstrings and divisibility of natural numbers. First, we establish that the equality problem admits a protocol of polylogarithmic communication, provided a laconic advice of just one bit. For the divisibility problem, we design a protocol with sublinear communication and advice of roughly Õ( √ n). We complement our result on divisibility with a matching lower bound in a restricted setting using a recent result of Chattopadhyay et al. and a reduction from set-disjointness to divisibility.
منابع مشابه
Adaptive Subcarrier Assignment and Power Distribution in Multiuser OFDM Systems with Proportional Data Rate Requirement
A low complexity dynamic subcarrier and power allocation methodology for downlink communication in an OFDM-based multiuser environment is developed. The problem of maximizing overall capacity with constraints on total power consumption, bit error rate and data rate proportionality among users requiring different QOS specifications is formulated. Assuming perfect knowledge of the instantaneo...
متن کاملA Suitable Coding Scheme for Broadband Power-line Communication
This paper introduces three coding strategies for using the Luby Transform (LT) code in a relay aided power-line communication scheme. In the first method, the relay decodes the received packets and re-encodes them for transmission towards the destination. In the second method, the relay only forwardes a random linear combination of its received packets towards the destination, while in the thi...
متن کاملDistance-Aware Beamforming for Multiuser Secure Communication Systems
Typical cryptography schemes are not well suited for low complexity types of equipment, e.g., Internet of things (IoT) devices, as they may need high power or impose high computational complexity on the device. Physical (PHY) layer security techniques such as beamforming (in multiple antennas systems) are possible alternatives to provide security for such applications. In this paper, we consid...
متن کاملOn Diophantine Complexity and Statistical Zero-Knowledge Arguments
We show how to construct laconic honest-verifier statistical zeroknowledge Diophantine arguments of knowledge (HVSZK AoK) that a committed tuple of integers belongs to S for all languages in bounded arithmetic. While doing this, we propose a new algorithm for computing the Lagrange representation of nonnegative integers and a new efficient representing polynomial for the exponential relation. A...
متن کاملConnections, Communication and Collaboration in Healthcare’s Complex Adaptive Systems; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”
A more sophisticated understanding of the unpredictable, disorderly and unstable aspects of healthcare organisations is developing in the knowledge translation (KT) literature. In an article published in this journal, Kitson et al introduced a new model for KT in healthcare based on complexity theory. The Knowledge Translation Complexity Network Model (KTCNM) provides a fresh perspective by mak...
متن کامل